Refining the search space of Alltop monomials

Genetic Programming for Data Classification: Refining the Search Space

Refining the Search for Organizational Success Measures

Measuring organizational success is a continuous challenge for both managers and researchers. While financial measures were in wide use for many years, new frameworks have emerged in recent years that extend organizational perspectives beyond traditional financial measures. Among them the Balanced Scorecard is one of the most popular new frameworks. However, in spite of its wide usage, it has s...

On Binary Search Tree Recursions with Monomials as Toll Functions

We consider distributional recursions which appear in the study of random binary search trees with monomials as toll functions. This extends classical parameters as the internal path length in binary search trees. As our main results we derive asymptotic expansions for the moments of the random variables under consideration as well as limit laws and properties of the densities of the limit dist...

Search Space Reduction for Farsi Printed Subwords Recognition by Position of the Points and Signs

In the field of the words recognition, three approaches of words isolation, the overall shape and combination of them are used. Most optical recognition methods recognize the word based on break the word into its letters and then recogniz them. This approach is faced some problems because of the letters isolation dificulties and its recognition accurcy in texts with a low image quality. Therefo...

Refining search queries using WordNet glosses

This paper describes one of the approaches how to overcome some major limitations of current fulltext search engines. It tries to discover semantic categories for proper nouns from WordNet glosses and verify them with Yahoo and Google. It relies on lexical patterns present in large repositories and it is inspired by Pankow [2]. It follows the paper from student workshop in April 2006 [6]. Some ...